Counting Boolean functions with faster points
نویسندگان
چکیده
منابع مشابه
Counting inequivalent monotone Boolean functions
Monotone Boolean functions (MBFs) are Boolean functions f : {0, 1} → {0, 1} satisfying the monotonicity condition x ≤ y ⇒ f(x) ≤ f(y) for any x, y ∈ {0, 1}. The number of MBFs in n variables is known as the nth Dedekind number. It is a longstanding computational challenge to determine these numbers exactly – these values are only known for n at most 8. Two monotone Boolean functions are inequiv...
متن کاملAlgorithms counting monotone Boolean functions
We give a new algorithm counting monotone Boolean functions of n variables (or equivalently the elements of free distributive lattices of n generators). We computed the number of monotone functions of 8 variables which is 56 130 437 228 687 557 907 788. 2001 Elsevier Science B.V. All rights reserved.
متن کاملCounting Meromorphic Functions with Critical Points of Large Multiplicities
We study the number of meromorphic functions on a Riemann surface with given critical values and prescribed multiplicities of critical points and values. When the Riemann surface is CP1 and the function is a polynomial, we give an elementary way of finding this number. In the general case, we show that, as the multiplicities of critical points tend to infinity, the asymptotic for the number of ...
متن کاملImproved Asymptotic Formulas for Counting Correlation Immune Boolean Functions
A Boolean function is called correlation immune if every input is independent of the output, when the inputs are chosen from a uniform distribution. Such functions are of interest in machine learning and stream cipher design. We show how an asymptotic formula of Denisov, which approximately counts the n-variable correlation immune functions, can be improved so as to be accurate even for fairly ...
متن کاملConstructing and Counting Even-Variable Symmetric Boolean Functions with Algebraic Immunity not Less Than $d$
In this paper, we explicitly construct a large class of symmetric Boolean functions on 2k variables with algebraic immunity not less than d, where integer k is given arbitrarily and d is a given suffix of k in binary representation. If let d = k, our constructed functions achieve the maximum algebraic immunity. Remarkably, 22 k⌋+2 symmetric Boolean functions on 2k variables with maximum algebra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2020
ISSN: 0925-1022,1573-7586
DOI: 10.1007/s10623-020-00738-7